首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   663篇
  免费   36篇
工业技术   699篇
  2024年   1篇
  2023年   2篇
  2022年   7篇
  2021年   9篇
  2020年   10篇
  2019年   7篇
  2018年   18篇
  2017年   17篇
  2016年   12篇
  2015年   16篇
  2014年   23篇
  2013年   46篇
  2012年   30篇
  2011年   57篇
  2010年   56篇
  2009年   36篇
  2008年   44篇
  2007年   42篇
  2006年   48篇
  2005年   24篇
  2004年   25篇
  2003年   12篇
  2002年   20篇
  2001年   16篇
  2000年   6篇
  1999年   2篇
  1998年   10篇
  1997年   7篇
  1996年   8篇
  1995年   11篇
  1994年   5篇
  1993年   5篇
  1992年   9篇
  1991年   7篇
  1990年   3篇
  1989年   4篇
  1988年   4篇
  1987年   7篇
  1986年   3篇
  1985年   2篇
  1984年   2篇
  1983年   3篇
  1982年   6篇
  1981年   2篇
  1980年   3篇
  1979年   1篇
  1978年   3篇
  1977年   3篇
  1976年   3篇
  1973年   2篇
排序方式: 共有699条查询结果,搜索用时 15 毫秒
81.
Tested 40 male and female high school and college students on the General and the Disinhibition subscales of the Sensation Seeking Scale (Form IV), the Reducer-Augmenter Scale (RAS), and the absolute auditory threshold (AAT). General sensation seeking correlated significantly with the RAS and the AAT. Both results were general across sex. These findings, that high-sensation seekers tend to be reducers and to lack sensitivity to weak stimulation, are interpreted as supporting strength-of-the-nervous-system theory more than the formulation of M. Zuckerman et al (see record 1975-02479-001). (36 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
82.
The best linear unbiased estimator of the parameter of the Rayleigh distribution using order statistics in a Type II censored sample from a potential sample of size N is considered. The coefficients for this estimator are tabled to five decimal places for N = 2(1)15 and censoring values of r1, (the number of observations censored from the left) and r2 (the number of observations censored from the right) such that r1 + r2 ? N - 2 for N = 2(1)10, r1 + r2 ? N - 3 for N = 11(1)15.  相似文献   
83.
A competitive neural network model and a genetic algorithm are used to improve the initialization and construction phase of a parallel insertion heuristic for the vehicle routing problem with time windows. The neural network identifies seed customers that are distributed over the entire geographic area during the initialization phase, while the genetic algorithm finds good parameter settings in the route construction phase that follows. Computational results on a standard set of problems are also reported.  相似文献   
84.
The laws specifying separate group areas and planned residential segregation have been abolished and non-racial social and living environments are espoused as state planning objectives. Yet an examination of current residential planning in the area between the Witwatersrand and the Vaal Triangle points to the fact that recently developed African areas like Orange Farm, Wildebeesfontein, Evaton West and Rietfontein appear to conform with the racial land zoning policies developed in the period when Dr Verwoerd was Minister of Native Affairs (Mabin and Royston 1991: 27). The more things appear to change, the more they seem to remain the same: a recent prospectus on reconstructing South African cities concludes that a recurring theme in the emergence of new planning regimes in the history of modern South Africa has been the persistence of older social and physical forms (Mabin and Smith 1992: 30). In the context of enormous and traumatic social and political change new, progressive urban planning ideas, which have as their starting point integration of the cities and empowerment of the citizenry, have taken root. Will the current idealism and popular democratic vision of reconstruction be eclipsed, as Mabin and Smit (1992: 30) put it, by ‘the accession to power of new regimes which have perverted the idealism and vision of reconstruction to less attractive ends’?  相似文献   
85.
86.
In this paper we describe a variant of A* search designed to run on the massively parallel, SIMD Connection Machine (CM-2). The algorithm is designed to run in a limited memory by the use of a retraction technique which allows nodes with poor heuristic values to be removed from the open list until such time as they may need reexpansion, more promising paths having failed. Our algorithm, called PRA* (for Parallel Retraction A*), is designed to maximize use of the Connection Machine′s memory and processors. In addition, the algorithm is guaranteed to return an optimal path when an admissible heuristic is used. Results comparing PRA* to Korf′s IDA* for the fifteen puzzle show significantly fewer node expansions for PRA*. In addition, empirical results show significant parallel speedups, indicative of the algorithm′s design for high processor utilization.  相似文献   
87.
The effect of the root-mean-square (rms) roughness on the acid etching of roughened amorphous silica was studied as a function of time using atomic force microscopy and laser light scattering. The initial size and distribution of micrometer-sized surface flaws are shown to influence the time evolution of the etching by hydrofluoric acid. The increase in the optical transparency of the samples is linked to the large increases in the correlation lengths of the sample surfaces, an effect which counteracts the accompanying rise in the rms roughness.  相似文献   
88.
89.
We describe several new algorithms for Byzantine agreement. The first of these is a simplification of the original exponential-time Byzantine agreement algorithm due to Pease, Shostak, and Lamport, and is of comparable complexity to their algorithm. However, its proof is very intuitively appealing. A technique of shifting between algorithms for solving the Byzantine agreement problem is then studied. We present two families of algorithms obtained by applying a shift operator to our first algorithm. These families obtain the same rounds to message length trade-off as do Coan's families but do not require the exponential local computation time (and space) of his algorithms. We also describe a modification of an -resilient algorithm for Byzantine agreement of Dolev, Reischuk, and Strong. Finally, we obtain a hybrid algorithm that dominates all our others, by beginning execution of an algorithm in one family, first shifting into an algorithm of the second family, and finally shifting into an execution of the adaptation of the Dolev, Reischuk, and Strong algorithm.  相似文献   
90.
The tissues in leaf blades, midribs, sheaths and stems of normal (N), 5848, and two brown midrib (bmr) mutants, 5753 and 5778, of pearl millet (Pennisetum glaucum (L) R Br) were examined for structural characteristics related to digestibility. The anatomies of the various plant parts were not substantially different between N and bmr plants. The more rigid, lignified tissues such as vascular bundles in all plant parts and the rind of stems were not digested after incubation for 7 days in N or bmr plants, indicating that modifications in these tissues were not sufficient to affect biodegradation. Modifications in the digestible tissues resulted in faster and more extensive degradation in bmr plants, and these changes appear to be the most significant in relation to biodegradation. The parenchyma of midveins and stems, which occupies c 70 and 60% of the cross-sectional area of these respective parts, were the sites where modification in phenolics resulted in the greatest improvement in digestibility.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号